Checking strong optimality of interval linear programming with inequality constraints and nonnegative constraints
نویسندگان
چکیده
منابع مشابه
Fully fuzzy linear programming with inequality constraints
Fuzzy linear programming problem occur in many elds such as mathematical modeling, Control theory and Management sciences, etc. In this paper we focus on a kind of Linear Programming with fuzzy numbers and variables namely Fully Fuzzy Linear Programming (FFLP) problem, in which the constraints are in inequality forms. Then a new method is proposed to ne the fuzzy solution for solving (FFLP). Nu...
متن کاملChecking Strong Optimality of Interval Linear Programming
In this paper, we will discusse the strong optimality of general interval linear program (IvLP), that is, the IvLP has an optimal solution for each realization, and some necessary and sufficient conditions are established, based on the duality theory. Keywordsoptimal solution; strongly feasible; duality;
متن کاملfully fuzzy linear programming with inequality constraints
fuzzy linear programming problem occur in many elds such as mathematical modeling, control theory and management sciences, etc. in this paper we focus on a kind of linear programming with fuzzy numbers and variables namely fully fuzzy linear programming (fflp) problem, in which the constraints are in inequality forms. then a new method is proposed to ne the fuzzy solution for solving (fflp). ...
متن کاملFUZZY LINEAR PROGRAMMING WITH GRADES OF SATISFACTION IN CONSTRAINTS
We present a new model and a new approach for solving fuzzylinear programming (FLP) problems with various utilities for the satisfactionof the fuzzy constraints. The model, constructed as a multi-objective linearprogramming problem, provides flexibility for the decision maker (DM), andallows for the assignment of distinct weights to the constraints and the objectivefunction. The desired solutio...
متن کاملA New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints
Most research on bilevel linear programming problem is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2014
ISSN: 0377-0427
DOI: 10.1016/j.cam.2013.09.075